Two-boundary lattice paths and parking functions
نویسندگان
چکیده
We describe an involution on a set of sequences associated with lattice paths with north or east steps constrained to lie between two arbitrary boundaries. This involution yields recursions (from which determinantal formulas can be derived) for the number and area enumerator of such paths. An analogous involution can be defined for parking functions with arbitrary lower and upper bounds. From this involution, we obtained determinantal formulas for the number and sum enumerator of such parking functions. For parking functions, there is an alternate combinatorial inclusion-exclusion approach. The recursions also yield Appell relations. In certain special cases, these Appell relations can be converted into rational or algebraic generating functions. The third author was supported in part by NSF grant #DMS-0245526.
منابع مشابه
On Parking Functions and the Zeta Map in Types B, C and D
Let Φ be an irreducible crystallographic root system with Weyl group W , coroot lattice Q̌ and Coxeter number h. Recently the second named author defined a uniform W -isomorphism ζ between the finite torus Q̌/(mh + 1)Q̌ and the set of non-nesting parking functions Park(Φ). If Φ is of type An−1 and m = 1 this map is equivalent to a map defined on labelled Dyck paths that arises in the study of the ...
متن کاملA Decomposition of Parking Functions by Undesired Spaces
There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the c...
متن کاملUndesired Parking Spaces and Contractible Pieces of the Noncrossing Partition Link
There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call the noncrossing partition link because it is the link of an edge in the former. The first author and his coauthors conjectured that various collections of si...
متن کاملA novel boundary condition for the simulation of the submerged bodies using lattice boltzmann method
In this study, we proposed a novel scheme for the implementation of the no-slip boundary condition in thelattice Boltzmann method (LBM) . In detail , we have substituted the classical bounce-back idea by the direct immersed boundary specification . In this way we construct the equilibrium density functions in such a way that it feels the no-slip boundaries . Therefore , in fact a kind of equili...
متن کاملA Comparative Solution of Natural Convection in an Open Cavity using Different Boundary Conditions via Lattice Boltzmann Method
A Lattice Boltzmann method is applied to demonstrate the comparison results of simulating natural convection in an open end cavity using different hydrodynamic and thermal boundary conditions. The Prandtl number in the present simulation is 0.71, Rayleigh numbers are 104,105 and 106 and viscosities are selected 0.02 and 0.05. On-Grid bounce-back method with first-order accuracy and non-slip met...
متن کامل